Using Linear Programming to Decode Binary Linear Codes

Using Linear Programming to Decode Linear Codes

Given a linear code and observations from a noisy channel, the decoding problem is to determine the most likely (ML) codeword. We describe a method for approximate ML decoding of an arbitrary binary linear code, based on a linear programming (LP) relaxation that is defined by a factor graph or parity check representation of the code. The resulting LP decoder, which generalizes our previous work...

New Binary Linear Codes

Binary Linear Block Codes

Mathematical Programming Approaches for Decoding of Binary Linear Codes

Binary linear complementary dual codes

Linear complementary dual codes (or codes with complementary duals) are codes whose intersections with their dual codes are trivial. We study binary linear complementary dual [n, k] codes with the largest minimum weight among all binary linear complementary dual [n, k] codes. We characterize binary linear complementary dual codes with the largest minimum weight for small dimensions. A complete ...